Completely Connected Clustered Graphs
نویسندگان
چکیده
Planar drawings of clustered graphs are considered. We introduce the notion of completely connected clustered graphs, i.e. hierarchically clustered graphs that have the property that not only every cluster but also each complement of a cluster induces a connected subgraph. As a main result, we prove that a completely connected clustered graph is c-planar if and only if the underlying graph is planar. Further, we investigate the influence of the root of the inclusion tree to the choice of the outer face of the underlying graph and vice versa.
منابع مشابه
Convex drawings of hierarchical planar graphs and clustered planar graphs
Hierarchical graphs are graphs with layering structures; clustered graphs are graphs with recursive clustering structures. Both have applications in VLSI design, CASE tools, software visualisation and visualisation of social networks and biological networks. Straight-line drawing algorithms for hierarchical graphs and clustered graphs have been presented in [P. Eades, Q. Feng, X. Lin and H. Nag...
متن کاملPlanarity Testing for C-Connected Clustered Graphs
We present a linear time algorithm for testing clustered planarity of c-connected clustered graphs and for computing a clustered planar embedding for such graphs. Our algorithm uses a decomposition of the input graph based on SPQR-trees and is the first linear time algorithm for clustered planarity testing. We define a normal form of clustered embeddings and show that a clustered graph is clust...
متن کاملClustered Planarity: Embedded Clustered Graphs with Two-Component Clusters
We present a polynomial-time algorithm for c-planarity testing of clustered graphs with fixed plane embedding and such that every cluster induces a subgraph with at most two connected components.
متن کاملAdvances in C-Planarity Testing of Clustered Graphs
A clustered graph C = (G; T ) consists of an undirected graph G and a rooted tree T in which the leaves of T correspond to the vertices of G = (V;E). Each vertex c in T corresponds to a subset of the vertices of the graph called \cluster". c-planarity is a natural extension of graph planarity for clustered graphs, and plays an important role in automatic graph drawing. The complexity status of ...
متن کاملClustered Level Planarity
Planarity is an important concept in graph drawing. It is generally accepted that planar drawings are well understandable. Recently, several variations of planarity have been studied for advanced graph concepts such as k-level graphs [6,10–16] and clustered graphs [5,7]. In k-level graphs, the vertices are partitioned into k levels and the vertices of one level are drawn on a horizontal line. I...
متن کامل